Verifying Numerical Convergence Rates
نویسنده
چکیده
2 Determining the order of accuracy We are often faced with the problem of how to determine the order p given a sequence of approximations ũh1 , ũh2 , . . . This is can be a good check that a method is correctly implemented (if p is known) and also a way to get a feeling for the credibility of an approximation ũh (high p means high credibility). We can either be in the situation that the exact value u is known, or, more commonly, that u is unknown.
منابع مشابه
Self Adaptive Artificial Bee Colony for Global Numerical Optimization
The ABC algorithm has been used in many practical cases and has demonstrated good convergence rate. It produces the new solution according to the stochastic variance process. In this process, the magnitudes of the perturbation are important since it can affect the new solution. In this paper, we propose a self adaptive artificial bee colony, called self adaptive ABC, for the global numerical op...
متن کاملTwo Fourth-order Iterative Methods Based on Continued Fraction for Root-finding Problems
In this paper, we present two new one-step iterative methods based on Thiele’s continued fraction for solving nonlinear equations. By applying the truncated Thiele’s continued fraction twice, the iterative methods are obtained respectively. Analysis of convergence shows that the new methods are fourth-order convergent. Numerical tests verifying the theory are given and based on the methods, two...
متن کاملNumerical Computations with H(div)-finite Elements for the Brinkman Problem
The H(div)-conforming approach for the Brinkman equation is studied numerically, verifying the theoretical a priori and a posteriori analysis in [21, 22]. We also present a hybridization technique for the problem, complete with convergence analysis and numerical verication. In addition, diffent boundary conditions and their enforcing along with the applicability of the method to some subsurface...
متن کاملConvergence Analysis and Computational Testing of the Finite Element Discretization of the Navier-Stokes Alpha Model
This report performs a complete analysis of convergence and rates of convergence of finite element approximations of the Navier-Stokes-α (NS-α) regularization of the NSE, under a zero-divergence constraint on the velocity, to the true solution of the NSE. Convergence of the discrete NS-α approximate velocity to the true Navier-Stokes velocity is proved and rates of convergence derived, under no...
متن کاملDynamic Rate Control Algorithms for HDR Throughput Optimization
The relative delay tolerance of data applications, together with the bursty traffic characteristics, opens up the possibility for scheduling transmissions so as to optimize throughput. A particularly attractive approach, in fading environments, is to exploit the variations in the channel conditions, and transmit to the user with the currently ‘best’ channel. We show that the ‘best’ user may be ...
متن کامل